Topology Preserving Constrained Graph Layout
نویسندگان
چکیده
Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm that takes an initial feasible layout and improves it while preserving the topology of the initial layout. The algorithm supports poly-line connectors and clusters. During layout the connectors and cluster boundaries act like impervious rubber-bands which try to shrink in length. The intended application for our algorithm is dynamic graph layout, but it can also be used to improve layouts generated by other graph layout techniques.
منابع مشابه
Interactive, Constraint-based Layout of Engineering Diagrams
Many engineering disciplines require visualisation of networks. Constrained graph layout is a powerful new approach to network layout that allows the user to impose a wide variety application-specific placement constraints—such as downwards pointing directed edges, alignment of nodes, cluster containment and non-overlapping nodes and clusters—on the layout. We have recently developed an efficie...
متن کاملDunnart: A Constraint-Based Network Diagram Authoring Tool
We present a new network diagram authoring tool, Dunnart, that provides continuous network layout. It continuously adjusts the layout in response to user interaction, while still maintaining the layout style and, where reasonable, the current layout topology. The diagram author uses placement constraints, such as alignment and distribution, to tailor the layout style and can guide the layout by...
متن کاملTopology-Preserving Watermarking of Vector Data
The embedding of a digital watermark in vector data results in a perturbation of the vertices which needs to be constrained in order to maintain geometric properties of the data. In this paper we investigate the problem of computing so-called perturbation regions in which the vertices of a planar straight-line graph may be dislocated while still preserving the topology of the input. We propose ...
متن کاملArea - Universal and Constrained Rectangular
A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. These layouts are used as rectangular cartograms in cartography, as floorplans in building architecture and VLSI design, and as graph drawings. Often areas are associated with the rectangles of a rectangular layout and it is desirable for one rectangular layout to represent several area assignm...
متن کاملScalable, Versatile and Simple Constrained Graph Layout
We describe a new technique for graph layout subject to constraints. Compared to previous techniques the proposed method is much faster and scalable to much larger graphs. For a graph with n nodes, m edges and c constraints it computes incremental layout in time O(n logn+m+ c) per iteration. Also, it supports a much more powerful class of constraint: inequalities or equalities over the Euclidea...
متن کامل